The generalization of Pascal’s triangle from algebraic point of view
نویسندگان
چکیده
In this paper we generalize Pascal’s Triangle and examine the connections between the generalized triangles and powering integers and polynomials respectively. The interesting and really romantic Pascal’s Triangle is a favourite research field of mathematicians for a very long time. The table of binomial coefficients has been named after Blaise Pascal, a French scientist, but was known already by the ancient Chinese and others before Pascal (Edwards [1]). Among the elements of the triangle a lot of interesting connections exist. One of them is that from the n-th row of the triangle with positional addition we get the n-th power of 11 (Figure 1.), where n is a non-negativ integer, and the indices in the rows and columns run from 0. 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 · · · 1 = 11, 11 = 11, 121 = 11, 1331 = 11, 14641 = 11, 161051 = 11, . . . Figure 1: The powers of 11 in Pascal’s triangle This comes immediately from the binomial equality
منابع مشابه
On Some (Pseudo) Involutions in the Riordan Group
In this paper, we address a question posed by L. Shapiro regarding algebraic and/or combinatorial characterizations of the elements of order 2 in the Riordan group. We present two classes of combinatorial matrices having pseudo-order 2. In one class, we find generalizations of Pascal’s triangle and use some special cases to discover and prove interesting identities. In the other class, we find ...
متن کاملGeneralization of an Identity of Andrews
Abstract We consider an identity relating Fibonacci numbers to Pascal’s triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, all of them rather involved or else relying on sophisticated number theoretical arguments. We not only give a simple and elementary proof, but also show the identity generalizes to arrays other than Pascal’s triangle. As an application w...
متن کاملPascal’s triangle and other number triangles in Clifford Analysis
The recent introduction of generalized Appell sequences in the framework of Clifford Analysis solved an open question about a suitable construction of power-like monogenic polynomials as generalizations of the integer powers of a complex variable. The deep connection between Appell sequences and Pascal’s triangle called also attention to other number triangles and, at the same time, to the cons...
متن کاملPascal’s Triangles in Abelian and Hyperbolic Groups
We are used to imagining Pascal’s triangle as extending forever downwards from a vertex located at the top. But it is interesting to see it as occupying the first quadrant of the plane with it’s vertex at (0, 0). Imagine further that the plane is made of graph paper — that is, that we have embedded into it the Cayley graph of Z × Z with respect to the standard generating set. If we place the en...
متن کاملPascal’s Triangle and Divisibility
In this chapter we will be investigating the intricacies of a seemingly innocuous mathematical object Pascal’s Triangle. After a brief refresher of our understanding of the triangle, we will delve into Cellular Automata as a method of building patterns, and then relate this to a specific pattern within Pascal’s Triangle. Then we shall investigate specific divisibility identities that can aid in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009